Introduction to Algorithms
Algorithm Specification-Insertion-Sort
Recursion-01
Recursion-02
Recrusion-03 (Binary Search, Linear Search)
Algorithm Analysis-01
Algorithm Analysis-02
Algorithm Analysis-03
BubbleSort-Analysis-Arrays-01
Array-ADT-02-Pointers in C revision-01
Pointers in C revision-02
Special-Class-Pointers in C revision-03
Polynomial ADT-01
Polynomial ADT-02
Stack with Arrays (compensation for Apr-27)
Queue with Arrays
SLL-01
SLL-02
DLL-01
DLL-02 and CLL
SLL and DLL with head node
Stack and Queue with Linked Lists
Infix To Postfix Conversion
Postfix Evaluation
Polynomial Operations with LL; General-Trees-01
General Trees-02
Binary Tree-01
Binary Tree-02; Traversals
Tree Traversals
BST-01
BST-02
BST-03
AVL Trees 01
AVL Trees 02
AVL Trees 03
AVL Trees 04; Graphs 01
B Trees - 1 (Recorded videos due to want of time)
B Trees - 2 (Recorded videos due to want of time
B Trees - 3(Recorded videos due to want of time)
Graphs 02
Graphs 03
Graphs 04
QuickSort-01 (class Contd)
QuickSort-02 and MergeSort-01
MergeSort-02 and Heap-Sort-01
Heap-Sort-02
Hashing-01
Hashing-02, Selection Sort
File Organizaion overview and Revision
